// 2025/5/29
// kotori和n皇后

#include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;

int main() {
    int k; cin >> k;
    vector<pair<int, int>> pos(k);
    for(auto& xy : pos)
    {
        cin >> xy.first >> xy.second;
    }
    int last = 0;
    unordered_set<int> x_set, y_set, p_set, n_set;
    for(int i = 0; i < k; i++)
    {
        int x = pos[i].first, y = pos[i].second;
        if(x_set.count(x) || y_set.count(y) || p_set.count(x - y) || n_set.count(x + y))
            break;
        x_set.emplace(x);
        y_set.emplace(y);
        p_set.emplace(x - y);
        n_set.emplace(x + y);
        last++;
    }
    int t, q; cin >> t;
    while(t--)
    {
        cin >> q;
        if(q <= last) cout << "No" << endl;
        else cout << "Yes" << endl;
    }
}
// 64 位输出请用 printf("%lld")